Feedback numbers of Kautz undirected graphs
نویسندگان
چکیده
The feedback number f(d, n) of the Kautz undirected graph UK(d, n) is the minimum number of vertices whose removal results in an acyclic graph. This paper shows (d − dn−1 − 1 2 d(d + 1) + 1)/(2d − 1) ≤ f(d, n) ≤ d − ( d2 4 + 1)dn−2, which implies that f(2, n) = 2n−1, as obtained by Královič and Ružička [Information Processing Letters 86 (4) (2003), 191–196].
منابع مشابه
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs
This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets ...
متن کاملNeighborhood Broadcasting in Undirected de Bruijn and Kautz Networks
This paper considers a neighborhood broadcasting protocol in undirected de Bruijn and Kautz networks. The neighborhood broadcasting problem(NBP) is the problem of disseminating a message from an originator vertex to only its neighbors. Our protocol works under the single-port and half-duplex model and solves NBP in 5 log2(n + 1) + O(1) time units on the undirected de Bruijn graph UB(n, d) with ...
متن کاملReinforcement numbers of digraphs
The reinforcement number of a graph G is the minimum cardinality of a set of extra edges whose addition results in a graph with domination number less than the domination number of G. In this paper we consider this parameter for digraphs, investigate the relationship between reinforcement numbers of undirected graphs and digraphs, and obtain further results for regular graphs. We also determine...
متن کاملThe Restricted Edge-Connectivity of Kautz Undirected Graphs
A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. The restricted edge-connectivity λ′ of a connected graph is the minimum number of edges whose deletion results in a disconnected graph such that each connected component has at least two vertices. A graph G is called λ′-optimal if λ′(G) = min{dG(u)+dG(v)−2 : uv is an edge in G}. This paper proves t...
متن کاملBroadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks Broadcasting and Gossiping on De Bruijn, Shuue-exchange and Similar Networks
We use simple compound properties of de Bruijn related networks to get new bounds about broadcasting and gossiping on such networks. We get some asymptotically optimal results on undi-rected de Bruijn, Kautz, and generalization of the shuue-exchange networks. Our techniques allow more generally to derive eecient broadcasting protocols for the undirected graph associated to a line digraph. As ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 52 شماره
صفحات -
تاریخ انتشار 2012